On excitable β-skeletons
نویسندگان
چکیده
منابع مشابه
On growing connected β-skeletons
A β-skeleton, β ≥ 1, is a planar proximity undirected graph of an Euclidean points set, where nodes are connected by an edge if their lune-based neighbourhood contains no other points of the given set. Parameter β determines the size and shape of the lune-based neighbourhood. A β-skeleton of a random planar set is usually a disconnected graph for β > 2. With the increase of β, the number of edg...
متن کاملβ-skeletons for a Set of Line Segments in R2
We generalize β-skeletons, well-known neighborhood graphs for point sets, to sets of line segments and present algorithms for computing such skeletons, both circle and lens-based, for the entire range of β values. In particular, for β ≥ 1 the β-skeleton for a set S on n segments in the Euclidean plane can be constructed in O(nα(n) log n) time and the construction relies on the Delaunay triangul...
متن کاملOn Herbrand Skeletons
Herbrand's theorem plays an important role both in proof theory and in computer science. Given a Herbrand skeleton, which is basically a number specifying the count of disjunctions of the matrix, we would like to get a computable bound on the size of terms which make the disjunction into a quasitautology. This is an important problem in logic, speciically in the complexity of proofs. In compute...
متن کاملOn Cartesian skeletons of graphs
Under suitable conditions of connectivity or non-bipartiteness, each of the three standard graph products (the Cartesian product, the direct product and the strong product) satisfies the unique prime factorization property, and there are polynomial algorithms to determine the prime factors. This is most easily proved for the Cartesian product. For the other products, current proofs involve a no...
متن کاملCompiling and supporting skeletons on MPP
Parallel programming needs a high level programming model in which compilers and run time supports take care of traditionally intractable problems related to efficient usage of the target machine (mapping, scheduling, data decomposition, etc.). The matter of designing a real system providing such a model is highly simplified by constructing the parallel programs using scalable skeletons which c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Science
سال: 2010
ISSN: 1877-7503
DOI: 10.1016/j.jocs.2010.07.003